Linear Time Average Consensus on Fixed Graphs∗∗This work was supported by NSF award CMMI-1463262.
نویسندگان
چکیده
منابع مشابه
Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control
We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes n. More precisely, we provide a protocol which results in each node having a value within an of the initial average after O ( n ln ||x(1)−x1||2 ) iterations. The protocol is completely distributed, with the exception of requiring each node to kn...
متن کاملOn Capacity of Non-Coherent Diamond NetworksThis work was supported in part by NSF grants 1514531 and 1314937
There is a vast body of work on the capacity bounds for a "coherent" wireless network, where the network channel gains are known, at least at the destination. However, there has been much less attention to the case where the network parameters (channel gains) are unknown to everyone, i.e., the non-coherent wireless network capacity. In this paper, we study the generalized degrees of freedom (gD...
متن کاملDiscrete-time dynamic average consensus
Wepropose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set ...
متن کاملThe matching problem has no small symmetric SDP
Yannakakis [1991, 1988] showed that the matching problem does not have a small symmetric linear program. Rothvoß [2014] recently proved that any, not necessarily symmetric, linear program also has exponential size. In light of this, it is natural to ask whether the matching problem can be expressed compactly in a framework such as semidefinite programming (SDP) that is more powerful than linear...
متن کاملAsymptotically Unbiased Average Consensus under Measurement Noises and Fixed Topologies
This paper is concerned with average-consensus control under directed topologies and random measurement noises. To attenuate the measurement noises, time-varying consensus gains are introduced in the protocol. It is shown that under the protocol designed, all agents’ states converge to a common Gaussian random variable, whose mathematical expectation is just the average of the initial states, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.10.313